Resource Type

Journal Article 8

Year

2020 1

2019 1

2016 3

2015 1

2007 1

2004 1

Keywords

Layout design 2

3D packing problem 1

Constructive algorithm 1

Energy landscape paving 1

FlexRay 1

Fourier transform infrared spectroscopy 1

Layout optimization 1

Meta-heuristics 1

Optimization 1

Packing 1

Particle Packing Method 1

Performance constraints 1

Real-time applications 1

Rectangle bin packing 1

Satellite module 1

Schedule optimization 1

Simulation 1

Slot multiplexing 1

Three-dimensional packing 1

Wang-Landau algorithm 1

open ︾

Search scope:

排序: Display mode:

Design of packing cup interference fit value of hypercompressors for low density polyethylene production

Da LEI,Xuehong LI,Yun LI,Xiwen REN

Frontiers in Energy 2019, Volume 13, Issue 1,   Pages 107-113 doi: 10.1007/s11708-017-0450-1

Abstract: A packing cup is the basic unit of cylinder packing, assembled by the interference fit between an innercup and an outer cup.Because the shrink-fitting prestresses the packing cup, serious design is needed to gain a favorableThe maximum Von Mises equivalent stress in a packing cup increases after a decline with the rise of thecup.

Keywords: interference fit value     packing cup     hypercompressor     finite element method (FEM)    

HAPE3D—a new constructive algorithm for the 3D irregular packing problem

Xiao LIU,Jia-min LIU,An-xi CAO,Zhuang-le YAO

Frontiers of Information Technology & Electronic Engineering 2015, Volume 16, Issue 5,   Pages 380-390 doi: 10.1631/FITEE.1400421

Abstract: a heuristic algorithm based on the principle of minimum total potential energy for the 3D irregular packingproblem, involving packing a set of irregularly shaped polyhedrons into a box-shaped container withthat HAPE3D does not need to calculate no-fit polyhedron (NFP), which is a huge obstacle for the 3D packingand prove that it can be hybridized quite well with a meta-heuristic algorithm to further improve the packing

Keywords: 3D packing problem     Layout design     Simulation     Optimization     Constructive algorithm     Meta-heuristics    

A rectangle bin packing optimization approach to the signal scheduling problem in the FlexRay static

Rui ZHAO,Gui-he QIN,Jia-qiao LIU

Frontiers of Information Technology & Electronic Engineering 2016, Volume 17, Issue 4,   Pages 375-388 doi: 10.1631/FITEE.1500232

Abstract: In this study, we propose a rectangle bin packing optimization approach to schedule communication signals

Keywords: FlexRay     Real-time applications     Rectangle bin packing     Schedule optimization     Slot multiplexing    

A Novel Approach to Solve Complex Packing Problems

Wang Tao,Wei Feng

Strategic Study of CAE 2004, Volume 6, Issue 12,   Pages 65-68

Abstract:

A novel approach which can solve complex packing problems is proposed.It solves the complex packing problems in two steps: Firstly, the volume-maximizing loading is carriedthe position of the center of gravity is adjusted optimally by genetic algorithm, so as to make the packingThe practical result shows that it is better than other packing approaches in terms of the usage rate

Keywords: packing problems     heuristic     center of gravity     genetic algorithm    

Understanding the behavior of recycled aggregate concrete by using thermogravimetric analysis

Subhasis PRADHAN, Shailendra KUMAR, Sudhirkumar V. BARAI

Frontiers of Structural and Civil Engineering 2020, Volume 14, Issue 6,   Pages 1561-1572 doi: 10.1007/s11709-020-0640-5

Abstract: aggregate and recycled coarse aggregate (RCA)) and mix design methods (conventional method and Particle Packing

Keywords: recycled aggregate concrete     Particle Packing Method     thermogravimetric analysis     chemically bound water    

new energy landscape paving heuristic for satellite module layouts Article

Jing-fa LIU,Juan HUANG,Gang LI,Wen-jie LIU,Ting-zhao GUAN,Liang HAO

Frontiers of Information Technology & Electronic Engineering 2016, Volume 17, Issue 10,   Pages 1031-1043 doi: 10.1631/FITEE.1500302

Abstract: This article describes a study of the satellite module layout problem (SMLP), which is a three-dimensional (3D) layout optimization problem with performance constraints that has proved to be non-deterministic polynomial-time hard (NP-hard). To deal with this problem, we convert it into an unconstrained optimization problem using a quasi-physical strategy and the penalty function method. The energy landscape paving (ELP) method is a class of Monte-Carlo-based global optimization algorithm that has been successfully applied to solve many optimization problems. ELP can search for low-energy layouts via a random walk in complex energy landscapes. However, when ELP falls into the narrow and deep valleys of an energy landscape, it is difficult to escape. By putting forward a new update mechanism of the histogram function in ELP, we obtain an improved ELP method which can overcome this drawback. By incorporating the gradient method with local search into the improved ELP method, a new global search optimization method, nELP, is proposed for SMLP. Two representative instances from the literature are tested. Computational results show that the proposed nELP algorithm is an effective method for solving SMLP with performance constraints.

Keywords: Three-dimensional packing     Energy landscape paving     Layout optimization     Performance constraints    

Study on Bio-Purifying Several Gaseous Pollutants

Sun Shi,Wang Jie,Wu Xianhua,Li Xiaomei,Xu XIaoyi,Deng Futang,Zhang Wei,Lei Yanmei,Zeng Erli

Strategic Study of CAE 2007, Volume 9, Issue 1,   Pages 73-77

Abstract: >S and NOx, which are commonly contained in industrial waste gases, by using the biofilm-packingAnd the purifying effects of biofilm-packing towers for three kinds of inorganic pollutants, SO2The suitable operation conditions of the biofilm-packing tower system for purifying the 7 kinds of gaseous

Keywords: seven kinds of gaseous pollutants     biofilm-packing tower     purification of waste gas     identifying ofbacteria    

Multi-objective layout optimization of a satellite module using the Wang-Landau sampling method with local search Project supported by the National Natural Science Foundation of China (Nos. 61373016 and 61403206), the Six Talent Peaks Project of Jiangsu Province, China (No. DZXX-041), the Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions, and the Natural Science Foundation of Jiangsu Province, China (No. BK20141005) Article

Jing-fa LIU,Liang HAO,Gang LI,Yu XUE,Zhao-xia LIU,Juan HUANG

Frontiers of Information Technology & Electronic Engineering 2016, Volume 17, Issue 6,   Pages 527-542 doi: 10.1631/FITEE.1500292

Abstract: The layout design of satellite modules is considered to be NP-hard. It is not only a complex coupled system design problem but also a special multi-objective optimization problem. The greatest challenge in solving this problem is that the function to be optimized is characterized by a multitude of local minima separated by high-energy barriers. The Wang-Landau (WL) sampling method, which is an improved Monte Carlo method, has been successfully applied to solve many optimization problems. In this paper we use the WL sampling method to optimize the layout of a satellite module. To accelerate the search for a global optimal layout, local search (LS) based on the gradient method is executed once the Monte-Carlo sweep produces a new layout. By combining the WL sampling algorithm, the LS method, and heuristic layout update strategies, a hybrid method called WL-LS is proposed to obtain a final layout scheme. Furthermore, to improve significantly the efficiency of the algorithm, we propose an accurate and fast computational method for the overlapping depth between two objects (such as two rectangular objects, two circular objects, or a rectangular object and a circular object) embedding each other. The rectangular objects are placed orthogonally. We test two instances using first 51 and then 53 objects. For both instances, the proposed WL-LS algorithm outperforms methods in the literature. Numerical results show that the WL-LS algorithm is an effective method for layout optimization of satellite modules.

Keywords: Packing     Layout design     Satellite module     Wang-Landau algorithm    

Title Author Date Type Operation

Design of packing cup interference fit value of hypercompressors for low density polyethylene production

Da LEI,Xuehong LI,Yun LI,Xiwen REN

Journal Article

HAPE3D—a new constructive algorithm for the 3D irregular packing problem

Xiao LIU,Jia-min LIU,An-xi CAO,Zhuang-le YAO

Journal Article

A rectangle bin packing optimization approach to the signal scheduling problem in the FlexRay static

Rui ZHAO,Gui-he QIN,Jia-qiao LIU

Journal Article

A Novel Approach to Solve Complex Packing Problems

Wang Tao,Wei Feng

Journal Article

Understanding the behavior of recycled aggregate concrete by using thermogravimetric analysis

Subhasis PRADHAN, Shailendra KUMAR, Sudhirkumar V. BARAI

Journal Article

new energy landscape paving heuristic for satellite module layouts

Jing-fa LIU,Juan HUANG,Gang LI,Wen-jie LIU,Ting-zhao GUAN,Liang HAO

Journal Article

Study on Bio-Purifying Several Gaseous Pollutants

Sun Shi,Wang Jie,Wu Xianhua,Li Xiaomei,Xu XIaoyi,Deng Futang,Zhang Wei,Lei Yanmei,Zeng Erli

Journal Article

Multi-objective layout optimization of a satellite module using the Wang-Landau sampling method with local search Project supported by the National Natural Science Foundation of China (Nos. 61373016 and 61403206), the Six Talent Peaks Project of Jiangsu Province, China (No. DZXX-041), the Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions, and the Natural Science Foundation of Jiangsu Province, China (No. BK20141005)

Jing-fa LIU,Liang HAO,Gang LI,Yu XUE,Zhao-xia LIU,Juan HUANG

Journal Article